Neural dynamics based complete grid coverage by single and multiple mobile robots
نویسندگان
چکیده
منابع مشابه
Complete Coverage by Mobile Robots Using Slice Decomposition Based on Natural Landmarks
In applications such as vacuum cleaning, painting, demining and foraging, a mobile robot must cover an unknown surface. The efficiency and completeness of coverage is improved by the construction of a map while the robot covers the surface. Existing methods generally use grid maps, which are susceptible to odometry error and may require considerable memory and computation. We propose a new “sli...
متن کاملComplete coverage path planning of mobile robots for humanitarian demining
The paper presents a path planning algorithm for a non-circular shaped mobile robot to autonomously navigate in an unknown area for humanitarian demining. For that purpose the path planning problem comes down to planning a path from some starting location to a final location in an area so that the robot covers all the reachable positions in the area while following the planned path. Based on ou...
متن کاملNeural Network-Based Coordinated Motion Planning of Multiple Mobile Robots
The present paper deals with the coordination issues of multiple wheeled robots working in a common dynamic environment, in a decentralized manner. Two different motion planners, one based on Neural Network and other using the potential field method have been developed to plan the motion of the robots. A strategic approach has been proposed to develop the decision making support. Performance of...
متن کاملGrid-Based Navigation for Autonomous, Mobile Robots
Navigation is a major challenge for autonomous, mobile robots. The problem can basically be divided into positioning and path planning. In this paper we present an approach which we call grid-based navigation. Though we also propose a scheme for path finding, we focus on positioning. Our approach uses minimal environmental infrastructure and only two light sensors on the mobile device itself. S...
متن کاملPath coordination for multiple mobile robots: a resolution-complete algorithm
This paper1 presents a geometry-based approach for multiple mobile robot motion coordination. The problem is to coordinate the motions of several robots moving along fixed independent paths to avoid mutual collisions. The proposed algorithm is based on a bounding box representation of the obstacles in the so-called coordination diagram. The algorithm is resolution-complete but it is shown to be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN Applied Sciences
سال: 2021
ISSN: 2523-3963,2523-3971
DOI: 10.1007/s42452-021-04508-5